Discrete Morse theory for weighted simplicial complexes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Morse Theory for free chain complexes

We extend the combinatorial Morse complex construction to the arbitrary free chain complexes, and give a short, self-contained, and elementary proof of the quasi-isomorphism between the original chain complex and its Morse

متن کامل

Discrete Morse Theory for Filtrations

Acknowledgements Enumerating all the ways in which I am grateful to Konstantin would essentially double the length of this document, so I'll save all that stuff for my autobiography. But I will note here that he was simultaneously patient, engaged, proactive, and – best of all – ruthlessly determined to refine and sculpt all our vague big-picture ideas into digestible and implementable concrete...

متن کامل

Extremal examples of collapsible complexes and random discrete Morse theory

We present extremal constructions connected with the property of simplicial collapsibility. (1) For each d ≥ 2, there are collapsible (and shellable) simplicial d-complexes with only one free face. Also, there are non-evasive d-complexes with only two free faces. (Both results are optimal in all dimensions.) (2) Optimal discrete Morse vectors need not be unique. We explicitly construct a contra...

متن کامل

Equivariant discrete Morse theory

In this paper, we study Forman's discrete Morse theory in the case where a group acts on the underlying complex. We generalize the notion of a Morse matching, and obtain a theory that can be used to simplify the description of the G-homotopy type of a simplicial complex. As an application, we determine the C2 × Sn−2-homotopy type of the complex of non-connected graphs on n nodes.

متن کامل

New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2020

ISSN: 0166-8641

DOI: 10.1016/j.topol.2019.107038